/*
 * Copyright (c) 2010-2011, okazoh_tk. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *  - Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 *  - Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 *  - Neither the name of the copyright holder nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "alkes/graph/Visitor.h"

namespace alkes {

Visitor::Visitor()
{
}

Visitor::~Visitor()
{
}

void Visitor::traverse(Composite* root)
{
    Element* element;
    sibling_.push(root);

    while (!parents_.isEmpty() || !sibling_.isEmpty())
    {
        if (!sibling_.isEmpty()) {

            element = sibling_.pop();

            if (element->isComposite()) {
                skip_child_ = false;

                visit(*static_cast<Composite*>(element));

                if (!skip_child_) {
                    Composite::Iterator iter = static_cast<Composite*>(element)->getLastChild();
                    while (iter) {
                        sibling_.push((Element*)static_cast<void*>(*iter));
                        iter = iter->getPrev();
                    }
                    parents_.push(static_cast<Composite*>(element)); // parent
                }
            } else {
                visit(*static_cast<Visual*>(element));
            }
        } else {
            visitPost(*parents_.pop());
        }
    }
}

void Visitor::skipChild()
{
    skip_child_ = true;
}

Composite* Visitor::getParent()
{
    return parents_.top();
}

uint32_t Visitor::getDepth() const
{
    return parents_.length();
}

void Visitor::visit(Visual& element)
{
    (void)element;
}

void Visitor::visit(Composite& element)
{
    (void)element;
}

void Visitor::visitPost(Composite& element)
{
    (void)element;
}

}
